a = int(input())
while a*2 != 0:
a = a - 1
b = int(input())
c = list(map(int,input().split()))
for i in range(len(c)):
print(max(c)-min(c))
break
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
int t, n;
signed main(){
if(ifstream("ok.inp")){
freopen("ok.inp", "r", stdin);
freopen("ok.out", "w", stdout);
}
cin >> t;
while (t--){
cin >> n;
int maxx = INT_MIN;
int minn = INT_MAX;
while (n--){
int num;
cin >> num;
maxx = max(maxx, num);
minn = min(minn, num);
}
cout << maxx - minn << endl;
}
}647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |